A Complete Bibliography of Publications in Designs, Codes, and Cryptography
نویسنده
چکیده
(0, 1) [628]. (0, 2) [962]. (0, 2, t) [637]. (0, α) [696, 844]. (1,−1) [518]. (1, 2) [1269]. (17, 9) [351]. (17q, 17, 2) [364]. (2) [1198]. (2, 2) [1179]. (2, 2) [1431]. (2, 7) [1432]. (2, 8) [667, 1133]. (2, n) [904]. (2, q) [1432]. (2, q) [1231]. (255, k) [657]. (25q, 25, 3) [364]. (28, 12, 11) [117]. (2) [1270]. (2) [1452]. (3, 4) [1788, 1872]. (3, 5∗, v) [578]. (3, 8) [667]. (3, p) [635]. (3, t) [1550]. (31, 10, 3) [34]. (36, 16, 12) [117]. (4) [659]. (4, 4) [634, 741]. (4, 8) [1133]. (49, 9, 6) [142]. (5, 2) [1138]. (6, 3) [835]. (6, q) [642]. (64, 2, 12) [236]. (8, 2) [451]. (96, 20, 4) [803]. (Ck ⊕G, k, 1) [251]. (G, k, 1) [251]. (k) [1634]. (k, n) [478, 1214]. (k, p) [425]. (λ+m)Kv+u\λKv [1803]. (m,n) [151]. (m− 1)/pm [167]. (n, 3) [1644]. (n, 4) [1467]. (n, q) [636]. (ν, 5, 5) [872]. (ν, 6, λ) [901]. (p, p, p, pa−1) [139]. (p, p, p, 1) [605]. (q) [362]. (q + t, t) [637]. (q, 6, 1) [342]. (Q−(5,q)) [1643]. (q + q + 2, q + 2) [540]. (q + q + 8)/2 [1125]. (q, 2) [1541]. (qm) [362]. (t, k) [1160]. (t,m, s) [814, 1332]. (t, n) [892, 1153, 1360]. (t− 1) [1534]. (v, {2, 4}, 1) [245]. (v, 3, 1) [581]. (v, 4, 2, 1) [1285]. (v, k, 1) [1835]. (v, k, 4) [1237]. (v, k, k − 1) [1892]. (v, k, λ) [109]. (v,K1(3) ∪ {w∗}) [1013]. (x(q + 1), x; 2, q) [1201]. (Z/4Z) × Z/5Z [522]. −1 [26]. −2 [751]. 0 [102, 205, 1422]. {0, 1, 2} [101]. 1 [205, 403, 465, 474, 548, 594, 642, 772, 778, 970, 977, 1191, 1329, 1373, 1450, 1457, 1497, 1598, 1670, 1680, 1681]. 1/2 [510]. 1/p [1609]. 103 [1130]. 12 [980, 1045]. 120
منابع مشابه
A Bibliography of Publications on Cryptography: 2000–2009
html; http: //www.elsevier.nl/gejng/10/41/16/186/20/29/ article.pdf.
متن کاملA Complete Bibliography of Publications in the Journal of Cryptology
abelian [326, 408, 91, 337]. Abstract [117]. Accelerated [512]. Accelerating [398]. Achieve [477]. Acoustic [525]. Adaptive [241, 390, 471]. Adaptively [523, 390]. Adic [130]. Advance [279]. Adversarial [458]. Adversaries [353, 345, 357, 403, 450, 472, 501, 236]. Adversary [173]. AES [373, 474, 346, 459]. AES-192 [474]. AES-256 [474]. AES-like [459]. after [76]. Against [353, 480, 520, 348, 500...
متن کاملA Bibliography of Publications in Designs, Codes, and Cryptography
(28, 12, 11) [117]. (31, 10, 3) [34]. (36, 16, 12) [117]. (49, 9, 6) [142]. (64, 2, 12) [236]. (Ck ⊕G,k, 1) [251]. (G, k, 1) [251]. (m,n) [151]. (m− 1)/pm [167]. (p, p, p, p) [139]. (q, 6, 1) [342]. (v, {2, 4}, 1) [245]. (v, k, λ) [109]. −1 [26]. 0 [102, 205]. {0, 1, 2} [101]. 1 [205]. 15 [102]. 2 [14, 36, 55, 61, 68, 86, 117, 142, 143, 223, 265, 266, 271, 296, 324]. 25 [302]. 27 [93, 120]. 28 ...
متن کاملClassification of line-transitive point-imprimitive linear spaces with line size at most 12
In this paper we complete a classification of finite linear spaces S with line size at most 12 admitting a line-transitive point-imprimitive subgroup of automorphisms. The examples are the Desarguesian projective planes of orders 4, 7, 9 and 11, two designs on 91 points with line size 6, and 467 designs on 729 points with line size 8.
متن کاملSome Optimal Codes From Designs
The binary and ternary codes spanned by the rows of the point by block incidence matrices of some 2-designs and their complementary and orthogonal designs are studied. A new method is also introduced to study optimal codes.
متن کاملEnumeration of t-Designs Through Intersection Matrices
In this paper, we exploit some intersection matrices to empower a backtracking approach based on Kramer–Mesner matrices. As an application, we consider the interesting family of simple t-ðtþ 8; tþ 2; 4Þ designs, 1 t 4, and provide a complete classification for t 1⁄4 1; 4, as well as a classification of all non-rigid designs for t 1⁄4 2; 3. We also enumerate all rigid designs for t 1⁄4 2. The co...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005